Viderman, Michael: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

Towards lower bounds on locally testable codes via density arguments

Ben-Sasson, Eli, Viderman, Michael

Journal:

Computational Complexity

Year:

2012

Language:

english

File:

PDF, 498 KB

english, 2012

2

Locally Testable Codes Require Redundant Testers

Ben-Sasson, Eli, Guruswami, Venkatesan, Kaufman, Tali, Sudan, Madhu, Viderman, Michael

Journal:

SIAM Journal on Computing

Year:

2010

Language:

english

File:

PDF, 277 KB

english, 2010

3

LP decoding of codes with expansion parameter above 2/3

Viderman, Michael

Journal:

Information Processing Letters

Year:

2013

Language:

english

File:

PDF, 151 KB

english, 2013

4

Composition of semi-LTCs by two-wise tensor products

Ben-Sasson, Eli, Viderman, Michael

Journal:

Computational Complexity

Year:

2015

Language:

english

File:

PDF, 504 KB

english, 2015

5

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - Strong LTCs with Inverse Poly-Log Rate and Constant Soundness

Viderman, Michael

Year:

2013

Language:

english

File:

PDF, 263 KB

english, 2013

6

[IEEE 2011 IEEE Annual Conference on Computational Complexity (CCC) - San Jose, CA, USA (2011.06.8-2011.06.11)] 2011 IEEE 26th Annual Conference on Computational Complexity - Towards Lower Bounds on Locally Testable Codes via Density Arguments

Ben-Sasson, Eli, Viderman, Michael

Year:

2011

Language:

english

File:

PDF, 282 KB

english, 2011

7

[IEEE 2009 24th Annual IEEE Conference on Computational Complexity (CCC) - Paris, France (2009.07.15-2009.07.18)] 2009 24th Annual IEEE Conference on Computational Complexity - Locally Testable Codes Require Redundant Testers

Ben-Sasson, Eli, Guruswami, Venkatesan, Kaufman, Tali, Sudan, Madhu, Viderman, Michael

Year:

2009

Language:

english

File:

PDF, 328 KB

english, 2009

8

[IEEE 2013 IEEE Conference on Computational Complexity (CCC) - Stanford, CA, USA (2013.06.5-2013.06.7)] 2013 IEEE Conference on Computational Complexity - Strong LTCs with Inverse Polylogarithmic Rate and Soundness

Viderman, Michael

Year:

2013

Language:

english

File:

PDF, 267 KB

english, 2013

9

[ACM Press the 3rd Innovations in Theoretical Computer Science Conference - Cambridge, Massachusetts (2012.01.08-2012.01.10)] Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on - ITCS '12 - Linear time decoding of regular expander codes

Viderman, Michael

Year:

2012

Language:

english

File:

PDF, 634 KB

english, 2012

10

Linear-time decoding of regular expander codes

Viderman, Michael

Journal:

ACM Transactions on Computation Theory

Year:

2013

Language:

english

File:

PDF, 225 KB

english, 2013

11

A combination of testability and decodability by tensor products

Viderman, Michael

Journal:

Random Structures & Algorithms

Year:

2015

Language:

english

File:

PDF, 218 KB

english, 2015

12

A combinatorial characterization of smooth LTCs and applications

Ben-Sasson, Eli, Viderman, Michael

Journal:

Random Structures & Algorithms

Year:

2016

Language:

english

File:

PDF, 237 KB

english, 2016

13

[ACM Press Companion of the The Web Conference 2018 - Lyon, France (2018.04.23-2018.04.27)] Companion of the The Web Conference 2018 on The Web Conference 2018 - WWW '18 - Automated Extractions for Machine Generated Mail

Di Castro, Dotan, Gamzu, Iftah, Grabovitch-Zuyev, Irena, Lewin-Eytan, Liane, Pundir, Abhinav, Sahoo, Nil Ratan, Viderman, Michael

Year:

2018

Language:

english

File:

PDF, 1.65 MB

english, 2018